The Parameterized Pram (preliminary Version)

نویسندگان

  • Timothy J. Harris
  • Murray I. Cole
چکیده

Various alternatives to the PRAM model have been proposed in recent literature. This paper deenes the notion of cost consistency, and shows that many previous PRAM-type models lack this important attribute. An alternative model of parallel computation, called the Pa-rameterized PRAM, is then introduced. This model is shown to be fully general, in the sense that many other PRAM models may be de-ned in term of the P-PRAM. The P-PRAM is then shown to be a useful tool in parallel algorithm design, due to its inherent cost consistency , and various P-PRAM algorithms are presented and analyzed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiplication, Division and Shift Instructions in Parallel Random Access Machines

Trahan, J.L., M.C. Loui and V. Ramachandran, Multiplication, division and shift instructions in parallel random access machines, Theoretical Computer Science 100 (1992) l-44. We prove that polynomial time on a parallel random access machine (PRAM) with unit-cost multiplication and division or on a PRAM with unit-cost shifts is equivalent to polynomial space on a Turing machine (PSPACE). This ex...

متن کامل

Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs (Preliminary Version)

We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal matching can all be constructed in (log n) expected time using n= log n processors on the CRCW PRAM. This is a substantial improvement over the best previous algorithms, which required ((log log n)) time and n log n p...

متن کامل

Connected components on distributed memory machines

The eeorts of the theory community to develop eecient PRAM algorithms often receive little attention from application programmers. Although there are PRAM algorithm implementations that perform reasonably on shared memory machines, they often perform poorly on distributed memory machines, where the cost of remote memory accesses is relatively high. We present a hybrid approach to solving the co...

متن کامل

The Queue-Read Queue-Write Asynchronous PRAM Model

This paper presents results for the queue-read, queue-write asynchronous parallel random access machine (qrqw asynchronous pram) model, which is the asynchronous variant of the qrqw pram model. The qrqw pram family of models, which was introduced earlier by the authors, permit concurrent reading and writing to shared memory locations, but each memory location is viewed as having a queue which c...

متن کامل

The Queue - Read Queue - WriteAsynchronous PRAM

This paper presents results for the queue-read, queue-write asynchronous parallel random access machine (qrqw asynchronous pram) model, which is the asynchronous variant of the qrqw pram model. The qrqw pram family of models, which was introduced earlier by the authors, permit concurrent reading and writing to shared memory locations, but each memory location is viewed as having a queue which c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007